Lococode Performs Nonlinear Ica without Knowing the Number of Sources

نویسنده

  • Sepp Hochreiter
چکیده

Low-complexity coding and decoding (Lococode), a novel approach to sensory coding, trains autoassocia-tors (AAs) by Flat Minimum Search (FMS), a recent general method for nding low-complexity networks with high generalization capability. FMS works by minimizing both training error and required weight precision. We nd that as a by-product Lococode separates nonlinear superpositions of sources without knowing their number. Assuming that the input data can be reduced to few simple causes (this is often the case with visual data), according to our theoretical analysis the hidden layer of an FMS-trained AA tends to code each input by a sparse code based on as few simple, independent features as possible. In experiments Lo-cocode extracts optimal codes for diicult, nonlinear versions of the \noisy bars" benchmark problem, while traditional ICA and PCA do not.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Feature Extraction Through LOCOCODE

Low-complexity coding and decoding (LOCOCODE) is a novel approach to sensory coding and unsupervised learning. Unlike previous methods, it explicitly takes into account the information-theoretic complexity of the code generator. It computes lococodes that convey information about the input data and can be computed and decoded by low-complexity mappings. We implement LOCOCODE by training autoass...

متن کامل

Low-Complexity Coding and Decoding

We present a novel approach to sensory coding and unsu-pervised learning. It is called \Low-complexity coding and decoding" (Lococode). Unlike previous methods it explicitly takes into account the information-theoretic complexity of the code generator: lococodes (1) convey information about the input data and (2) can be computed and decoded by low-complexity mappings. To implement Lococode we t...

متن کامل

Nonlinear ICA through low-complexity autoencoders

We train autoencoders by Flat Minimum Search (FMS), a regularizer algorithm for finding low-complexity networks describable by few bits of information. As a by-product, this encourages nonlinear independent component analysis (ICA) and sparse codes of the input data. Flat minima are regions in weight space where (a) there is tolerable small error and (b) you can perturb the weights without grea...

متن کامل

Lococode

\Low-complexity coding and decoding" (Lococode) is a novel approach to sensory coding and unsupervised learning. Unlike previous methods it explicitly takes into account the information-theoretic complexity of the code generator: lococodes (1) convey information about the input data and (2) can be computed and decoded by low-complexity mappings. We implement Lococode by training autoassociators...

متن کامل

A Recurrent ICA Approach to a Novel BSS Convolutive Nonlinear Problem

This paper introduces a Recurrent Flexible ICA approach to a novel blind sources separation problem in convolutive nonlinear environment. The proposed algorithm performs the separation after the convolutive mixing of post nonlinear convolutive mixtures. The recurrent neural network produces the separation by minimizing the output mutual information. Experimental results are described to show th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999